intersection algorithm造句
例句与造句
- finally, the convexity-concavity of the closed curve is detected . in the end, choi's pair-wise offset of polygon algorithm is improv ed based on the proposed curve intersection algorithm
文章最后完善了choi多边形等距偏移算法，并把本文提出的封闭曲线求交方法应用其中，用于自交点的确定。 - for the closed-curves consist of arcs and line segments, we present a fast approach to find intersections of closed-curve by extending park's polygonal chains intersection algorithm
对于圆弧和直线段组成的封闭曲线求交，本文通过拓展park多边形链求交方法提出了一个圆弧和直线段组成的封闭曲线求交方法。 - (1 ) presents a grid-based intersection algorithm of parametric surface and plane, which is characterized by effectiveness and conciseness, and has been successfully implemented in the rp data processing software
所作的主要工作如下：(1)提出一种基于网格划分的参数曲面与平面求交算法。这种算法简单、实用，已成功地应用于基于cad模型直接分层的rp数据处理软件中。 - in some time-critical situation, continuous ssi is computation bottleneck of some solid modeling system . conventional approach for solving continuous ssi often uses intersection algorithm iteratively without taking the characteristic of the surface into account to simplify computation . the dissertation analyzes the intersect curve structure of continue surface, from the point of intersect curve's evolution, it describes the relationship between topology of offset surface intersect curve and topology transmit point ( ttp )
等距曲面和运动曲面在cadcam领域中有着重要的应用，在一些时间敏感场合例如数控加工动态仿真，等距曲面和运动曲面等连续变化曲面求交运算已成为这些系统的计算瓶颈，连续变化曲面求交问题的通常解法是采用曲面求交算法反复迭代计算交线，没有考虑连续变化曲面交线之间的相似性进行求交简化，效率上一直不能有很大的提高。 - through the contrast between two algorithms, that one is the color histogram intersection algorithm which is based on the rgb color model and the other is improve matching algorithm based on color sector of the hsv color space, the result indicates that the retrieval efficiency of the later algorithm is better than the first
本文通过与基于rgb颜色空间的颜色直方图交叉算法作比较，试验表明该改进的基于颜色感知特征的检索算法可以达到较好的检索效果。同时本系统对非等间隔量化算法和等间隔量化算法进行测试比较，结果表明前者优于后者。 - It's difficult to find intersection algorithm in a sentence. 用intersection algorithm造句挺难的
- in this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge-pool-searching, which constrains the 3-d intersections into the 2-d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge-pool searching .; ( 2 ) reconstruction based on degenerated-polygon-intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones . the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation; ( 3 ) reconstruction algorithm based on ray-tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object
同时利用共极线原理把三维计算投影到二维平面以降低求交计算的复杂度，该算法可以减少光锥向图像平面投影计算的次数，以边池搜索取代散乱点集上进行的三角剖分；(2)基于退化多边形求交的多面体可见壳模型重构，系统引入退化多边形的概念，把锥体平面的交集中不连通的部分用一个退化多边形来表示，并引入了新的基于退化多边形的求交算法，与传统多面体可见壳重构相比，该算法有以下几点创新：在图像平面以退化多边形组织投影锥体和物体轮廓的交集，把任意锥面与物体轮廓的交集归一到一个退化多边形；基于退化多边形的二维平面上多边形快速相交算法，该算法在一定程度上就是两个有序链表的合并，大大简化了先前的布尔求交计算；(3)基于光线跟踪的算法，该算法中所有通过轮廓顶点的光线和对应其它图像轮廓的光锥进行求交计算，最后得到每次求交计算得到线段的交集，该线段的顶点就认为是物体表面点，从而得到物体表面的点云。 - in chapter 3, we discuss surface restoring method based on ct data which uses the intersection algorithm between spline curve and radial to resample the section curve, then works out surface controlling point array; take opengl to display the surface with reality and the lighting, coloring effect
第三章讨论了基于ct数据的曲面重构方法，利用样条曲线与射线的求交算法对截面曲线进行重新采样，并反算曲面控制点阵；在其后的显示过程中，利用opengl实现曲面的真实感显示，包括颜色、光照的变化等。 - cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly . new algorithms for orientation and inclusion test for simple polygon are proposed . and ghosh's convex hull algorithms for simple polygon and convex polygons, subramanian's triangulation algorithm for arbitrary planar domain and o'rourke's intersection algorithm for convex polygons are modified to make them more robust
断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了subramanian的平面多连通域的三角划分方法、ghosh的多边形的凸包及多个多边形的凸包算法和o'rourke的凸多边形的求交算法。